See Hadwiger conjecture on Wiktionary
{
"etymology_text": "Named after Hugo Hadwiger.",
"forms": [
{
"form": "the Hadwiger conjecture",
"tags": [
"canonical"
]
},
{
"form": "Hadwiger's conjecture",
"tags": [
"alternative"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Hadwiger conjecture",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [],
"source": "w"
},
{
"_dis": "28 33 39",
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"A conjecture regarding the relationship between the number of colors needed by a given graph and the size of its largest clique minor."
],
"id": "en-Hadwiger_conjecture-en-name-idvdZBsy",
"links": [
[
"graph theory",
"graph theory"
]
],
"raw_glosses": [
"(graph theory) A conjecture regarding the relationship between the number of colors needed by a given graph and the size of its largest clique minor."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
},
{
"categories": [
{
"kind": "other",
"langcode": "en",
"name": "Geometry",
"orig": "en:Geometry",
"parents": [],
"source": "w"
},
{
"_dis": "28 33 39",
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"The conjecture that at most 2n smaller homothetic bodies are necessary to contain any single given n-dimensional convex body."
],
"id": "en-Hadwiger_conjecture-en-name-ggfVhr4J",
"links": [
[
"geometry",
"geometry"
],
[
"homothetic",
"homothetic"
],
[
"convex",
"convex"
]
],
"raw_glosses": [
"(geometry) The conjecture that at most 2n smaller homothetic bodies are necessary to contain any single given n-dimensional convex body."
],
"topics": [
"geometry",
"mathematics",
"sciences"
]
},
{
"categories": [
{
"kind": "other",
"langcode": "en",
"name": "Geometry",
"orig": "en:Geometry",
"parents": [],
"source": "w"
},
{
"_dis": "30 24 46",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "24 24 52",
"kind": "other",
"name": "English entries with language name categories using raw markup",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "28 33 39",
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "31 18 51",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "25 24 50",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"The conjecture that every simplex can be dissected into orthoschemes, using a number of orthoschemes bounded by a function of the dimension of the simplex."
],
"id": "en-Hadwiger_conjecture-en-name-E8ZYITvz",
"links": [
[
"geometry",
"geometry"
],
[
"simplex",
"simplex"
],
[
"dissect",
"dissect"
],
[
"orthoscheme",
"orthoscheme"
],
[
"function",
"function"
],
[
"dimension",
"dimension"
]
],
"raw_glosses": [
"(geometry) The conjecture that every simplex can be dissected into orthoschemes, using a number of orthoschemes bounded by a function of the dimension of the simplex."
],
"topics": [
"geometry",
"mathematics",
"sciences"
]
}
],
"word": "Hadwiger conjecture"
}
{
"categories": [
"English entries with incorrect language header",
"English entries with language name categories using raw markup",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English terms with non-redundant non-automated sortkeys",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries"
],
"etymology_text": "Named after Hugo Hadwiger.",
"forms": [
{
"form": "the Hadwiger conjecture",
"tags": [
"canonical"
]
},
{
"form": "Hadwiger's conjecture",
"tags": [
"alternative"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Hadwiger conjecture",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"en:Graph theory"
],
"glosses": [
"A conjecture regarding the relationship between the number of colors needed by a given graph and the size of its largest clique minor."
],
"links": [
[
"graph theory",
"graph theory"
]
],
"raw_glosses": [
"(graph theory) A conjecture regarding the relationship between the number of colors needed by a given graph and the size of its largest clique minor."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
},
{
"categories": [
"en:Geometry"
],
"glosses": [
"The conjecture that at most 2n smaller homothetic bodies are necessary to contain any single given n-dimensional convex body."
],
"links": [
[
"geometry",
"geometry"
],
[
"homothetic",
"homothetic"
],
[
"convex",
"convex"
]
],
"raw_glosses": [
"(geometry) The conjecture that at most 2n smaller homothetic bodies are necessary to contain any single given n-dimensional convex body."
],
"topics": [
"geometry",
"mathematics",
"sciences"
]
},
{
"categories": [
"en:Geometry"
],
"glosses": [
"The conjecture that every simplex can be dissected into orthoschemes, using a number of orthoschemes bounded by a function of the dimension of the simplex."
],
"links": [
[
"geometry",
"geometry"
],
[
"simplex",
"simplex"
],
[
"dissect",
"dissect"
],
[
"orthoscheme",
"orthoscheme"
],
[
"function",
"function"
],
[
"dimension",
"dimension"
]
],
"raw_glosses": [
"(geometry) The conjecture that every simplex can be dissected into orthoschemes, using a number of orthoschemes bounded by a function of the dimension of the simplex."
],
"topics": [
"geometry",
"mathematics",
"sciences"
]
}
],
"word": "Hadwiger conjecture"
}
Download raw JSONL data for Hadwiger conjecture meaning in All languages combined (2.2kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2026-10-21 from the enwiktionary dump dated 2026-10-01 using wiktextract (c1bb342 and 6f96ddf). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.